// 26. Remove Duplicates from Sorted Array

// Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

// Do not allocate extra space for another array, you must do this in place with constant memory.

// For example,
// Given input array nums = [1,1,2],

// Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

package main

func removeDuplicates(nums []int) int {
	count := len(nums)
	if count < 2 {
		return count
	}

	index := 0
	for i := 1; i < count; i++ {
		if nums[i] != nums[index] {
			index++
			nums[index] = nums[i]
		}
	}

	return index + 1
}

func main() {
	nums := []int{1, 1, 2}
	println(removeDuplicates(nums))
	for i, v := range nums {
		println(i, ":", v)
	}
}
